List scheduling of general task graphs under LogP

List scheduling is the most frequently used scheduling technique. In this context worst case analysis as well as many experimental studies were performed for various computational models. However, many new models have been proposed during the last decade with the aim to provide a realistic but still simple and general model of parallel computation. LogP is one of the most popular models so far suggested. It takes into account the time a computation processor spends to manage a communication. Many experimental studies on current parallel architectures have shown that such a parameter cannot be neglected. The aim of this paper is to assess the applicability of the list scheduling approach to the LogP model. More precisely, we present two adaptations of the earliest task ®rst (ETF) heuristic. Then, we establish an upper bound on list schedules under LogP. Finally, we present an extensive experimental study for di€erent graph classes and model instances. Ó 2000 Elsevier Science B.V. All rights reserved.